Nash Implementable Domains for the Borda Count

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nash implementable domains for the Borda count

* We thank József Mala for posing the question of Nash implementability on restricted domains that led to this research. We are very grateful to two anonymous referees and an associate editor for their helpful comments and suggestions. The second author gratefully acknowledges financial support from the Hungarian Academy of Sciences (MTA) through the Bolyai János research fellowship. Summary. W...

متن کامل

Non-manipulable domains for the Borda count

We characterize the preference domains on which the Borda count satisfies Arrow’s “independence of irrelevant alternatives” condition. Under a weak richness condition, these domains are obtained by fixing one preference ordering and including all its cyclic permutations (“Condorcet cycles”). We then ask on which domains the Borda count is non-manipulable. It turns out that it is non-manipulable...

متن کامل

A Borda count for partially ordered ballots

The application of the theory of partially ordered sets to voting systems is an important development in the mathematical theory of elections. Many of the results in this area are on the comparative properties between traditional elections with linearly ordered ballots and those with partially ordered ballots. In this paper we present a scoring procedure, called the partial Borda count, that ex...

متن کامل

The Borda Count, the Kemeny Rule, and the Permutahedron

A strict ranking of n items may profitably be viewed as a permutation of the objects. In particular, social preference functions may be viewed as having both input and output be such rankings (or possibly ties among several such rankings). A natural combinatorial object for studying such functions is the permutahedron, because pairwise comparisons are viewed as particularly important. In this p...

متن کامل

The Borda Count and Dominance Solvable Voting Games

We analyse dominance solvability (by iterated elimination of weakly dominated strategies) of voting games with three candidates and provide sufficient and necessary conditions for the Borda Count to yield a unique winner. We find that Borda is the unique scoring rule that is dominance solvable both (i) under unanimous agreement on a best candidate and (ii) under unanimous agreement on a worst c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2006

ISSN: 1556-5068

DOI: 10.2139/ssrn.944006